-
1 алгоритм упорядочения
Русско-английский словарь по электронике > алгоритм упорядочения
-
2 алгоритм упорядочения
Русско-английский словарь по радиоэлектронике > алгоритм упорядочения
-
3 алгоритм упорядочения
Русско-английский словарь по вычислительной технике и программированию > алгоритм упорядочения
-
4 алгоритм упорядочения
Русско-английский политехнический словарь > алгоритм упорядочения
-
5 алгоритм упорядочения
отношение порядка; способ упорядочения — ordering relation
Русско-английский большой базовый словарь > алгоритм упорядочения
-
6 алгоритм упорядочивания
алгоритм упорядочивания
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Русско-английский словарь нормативно-технической терминологии > алгоритм упорядочивания
-
7 алгоритм упорядочения
1) Engineering: ordering algorithm2) Programming: sequencing algorithm, sort algorithm (тж. алгоритм сортировки; каждый алгоритм сортировки можно отнести к одному из трёх базовых методов: перестановка элементов, их отбор и вставка), sorting algorithm (тж. алгоритм сортировки; каждый алгоритм сортировки можно отнести к одному из трёх базовых методов: перестановка элементов, их отбор и вставка)Универсальный русско-английский словарь > алгоритм упорядочения
См. также в других словарях:
Algorithm — A set of rules for accomplishing a task in a certain number of steps. One common example is a recipe, which is an algorithm for preparing a meal. Algorithms are essential for computers to process information. As such, they have become central to… … Investment dictionary
Minimum degree algorithm — In numerical analysis the minimum degree algorithm is an algorithm used to permute the rows and columns of a symmetric sparse matrix before applying the Cholesky decomposition, to reduce the number of non zeros in the Cholesky factor. This… … Wikipedia
Basic Timestamp Ordering — (BTO) ist ein Algorithmus zur Synchronisierung verteilter Systeme. Der Algorithmus stellt sicher, dass Transaktionen, die in verschiedenen parallel laufenden Komponenten erzeugt werden, einander nicht „überholen“. Dazu ist es nicht notwendig, die … Deutsch Wikipedia
Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques … Wikipedia
Coffman–Graham algorithm — In job shop scheduling and graph drawing, the Coffman–Graham algorithm is an algorithm, named after Edward G. Coffman, Jr. and Ronald Graham, for arranging the elements of a partially ordered set into a sequence of levels. The algorithm chooses… … Wikipedia
Dekker's algorithm — is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes.[1] It… … Wikipedia
OPTICS algorithm — OPTICS ( Ordering Points To Identify the Clustering Structure ) is an algorithm for finding density based clusters in spatial data. It was presented by Mihael Ankerst, Markus M. Breunig, Hans Peter Kriegel and Jörg Sander[1]. Its basic idea is… … Wikipedia
Kahan summation algorithm — In numerical analysis, the Kahan summation algorithm (also known as compensated summation) significantly reduces the numerical error in the total obtained by adding a sequence of finite precision floating point numbers, compared to the obvious… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Crossover (genetic algorithm) — In genetic algorithms, crossover is a genetic operator used to vary the programming of a chromosome or chromosomes from one generation to the next. It is analogous to reproduction and biological crossover, upon which genetic algorithms are based … Wikipedia
Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… … Wikipedia